منابع مشابه
Risk-sensitive benchmarked asset management
This paper extends the risk-sensitive asset management theory developed by Bielecki and Pliska and by Kuroda and Nagai to the case where the investor’s objective is to outperform an investment benchmark. The main result is a mutual fund theorem. Every investor following the same benchmark will take positions, in proportions dependent on his/her risk sensitivity coefficient, in two funds: the lo...
متن کاملGame-theoretic approach to risk-sensitive benchmarked asset management
In this article we consider a game theoretic approach to the Risk-Sensitive Benchmarked Asset Management problem (RSBAM) of Davis and Lleo [6]. In particular, we consider a stochastic differential game between two players, namely, the investor who has a power utility while the second player represents the market which tries to minimize the expected payoff of the investor. The market does this b...
متن کاملVicinal Risk Minimization
The Vicinal Risk Minimization principle establishes a bridge between generative models and methods derived from the Structural Risk Minimization Principle such as Support Vector Machines or Statistical Regularization. We explain how VRM provides a framework which integrates a number of existing algorithms, such as Parzen windows, Support Vector Machines, Ridge Regression, Constrained Logistic C...
متن کاملCounterfactual Risk Minimization
We develop a learning principle and an efficient algorithm for batch learning from logged bandit feedback. Unlike in supervised learning, where the algorithm receives training examples (xi, y ∗ i ) with annotated correct labels y ∗ i , bandit feedback merely provides a cardinal reward δi ∈ R for the prediction yi that the logging system made for context xi. Such bandit feedback is ubiquitous in...
متن کاملRanking - convex risk minimization
The problem of ranking (rank regression) has become popular in the machine learning community. This theory relates to problems, in which one has to predict (guess) the order between objects on the basis of vectors describing their observed features. In many ranking algorithms a convex loss function is used instead of the 0−1 loss. It makes these procedures computationally efficient. Hence, conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Finance
سال: 2014
ISSN: 0960-1627
DOI: 10.1111/mafi.12065